The arithmetic of reversed positional games
نویسندگان
چکیده
منابع مشابه
Positional Games
Course number: 0366.4991. Course webpage: www.math.tau.ac.il/∼krivelev/teaching/PosGames/PG.html When and where: Wednesdays 15-18, Schreiber 007 Prospective audience: the course is intended for graduate and advanced undergraduate students in Mathematics and Computer Science. Informal prerequisites: working knowledge of graph theory notions; knowledge of basic concepts in probability. Grading: H...
متن کاملThe Parameterized Complexity of Positional Games
We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows’ influential list of open problems from 1999. Previously, the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-orde...
متن کاملOn Ramsey-type positional games
Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding to structural extensions of Ramsey and van der Waerden theorems—the theorem of Brauer, structural and restricted Ramsey theorems.
متن کاملOn Chooser-Picker positional games
Two new versions of the so-called Maker-Breaker Positional Games are defined by József Beck. In these variants Picker takes unselected pair of elements and Chooser keeps one of these elements and gives back the other to Picker. In the Picker-Chooser version Picker is Maker and Chooser is Breaker, while the roles are swapped in the Chooser-Picker version. It seems that both the Picker-Chooser an...
متن کاملA Metric for Positional Games
We deene an extended real-valued metric, , for positional games and prove that this class of games is a topological semigroup. We then show that two games are nitely separated ii they are path-connected and ii two closely related Conway games are equivalent. If two games are at a nite distance then this distance is bounded by the maximum diierence of any two atoms found in the games. We may imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00156-9